Upward Planarization Layout
نویسندگان
چکیده
Abstract. Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straight-forward approaches for drawing such UPRs lead to quite unsatisfactory results. In this paper, we present a new algorithm for drawing UPRs that greatly improves the layout quality, leading to good hierarchal drawings with few crossings. We analyze its performance on well-known benchmark graphs and compare it with alternative approaches.
منابع مشابه
Upward planarization and layout
Drawing directed graphs has many applications and occurs whenever a natural flow of information is to be visualized. Given a directed acyclic graph (DAG) G, we are interested in an upward drawing of G, that is, a drawing of G in which all arcs are drawn as curves that are monotonically increasing in the vertical direction. Besides the upward property, it is desirable that the number of arc cros...
متن کاملAn Approach for Mixed Upward Planarization
In this paper, we consider the problem of finding a mixed upward planarization of a mixed graph, i.e., a graph with directed and undirected edges. The problem is a generalization of the planarization problem for undirected graphs and is motivated by several applications in graph drawing. We present a heuristic approach for this problem which provides good quality and reasonable running time in ...
متن کاملCompression Algorithms for \Dummy Fill" VLSI Layout Data
Dummy fill is introduced into sparse regions of a VLSI layout to equalize the spatial density of the layout, improving uniformity of chemical-mechanical planarization (CMP). It is now well-known that dummy fill insertion for CMP uniformity changes the back-end flow with respect to layout, parasitic extraction and performance analysis. Of equal import is dummy fill’s impact on layout data volume...
متن کاملExamining the Compactness of Automatically Generated Layouts for Practical Diagrams
Graph drawing algorithms have important practical applications, e. g. layer-based algorithms for data flow diagram layout in embedded software design and planarization-based algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization of aesthetic criteria such as the number of edge crossings and bends. The aspects of compactness and aspect r...
متن کاملWafer Scale Variation of Planarization Length in Chemical Mechanical Polishing
Chemical mechanical polishing (CMP) is widely used for pla-narization of advanced interconnect and shallow trench isolation structures in integrated circuit manufacture. Of particular concern is within-die variation in the interlevel dielectric or oxide thickness remaining after polish, due to pattern density variations across the die. 1 Recent modeling of CMP has shown that a " planarization l...
متن کامل